On Minimax Fractional Optimality Conditions with Invexity
نویسندگان
چکیده
منابع مشابه
Optimality Conditions and Duality in Multiobjective Programming with Invexity*
( , ) ρ Φ − invexity has recently been introduced with the intent of generalizing invex functions in mathematical programming. Using such conditions we obtain new sufficiency results for optimality in multiobjective programming and extend some classical duality properties.
متن کاملOptimality Conditions and Duality in Nondifferentiable Minimax Fractional Programming with Generalized Convexity1
We establish sufficient optimality conditions for a class of nondifferentiable minimax fractional programming problems involving (F, α, ρ, d)convexity. Subsequently, we apply the optimality conditions to formulate two types of dual problems and prove appropriate duality theorems.
متن کاملSufficiency and Duality in Minimax Fractional Programming with Generalized (φ, Ρ)-invexity
Amongst various important applications, one important application of nonlinear programming is to maximize or minimize the ratio of two functions, commonly called fractional programming. The characteristics of fractional programming problems have been investigated widely [1, 6, 10] and [13]. In noneconomic situations, fractional programming problems arisen in information theory, stochastic progr...
متن کاملDuality in nondifferentiable minimax fractional programming with B-(p, r)-invexity
* Correspondence: drizhar@kfupm. edu.sa Department of Mathematics and Statistics, King Fahd University of Petroleum and Minerals, Dhahran 31261, Saudi Arabia Full list of author information is available at the end of the article Abstract In this article, we are concerned with a nondifferentiable minimax fractional programming problem. We derive the sufficient condition for an optimal solution t...
متن کاملOptimality criteria for sum of fractional multiobjective optimization problem with generalized invexity
The sum of a fractional program is a nonconvex optimization problem in the field of fractional programming and it is difficult to solve. The development of research is restricted to single objective sums of fractional problems only. The branch and bound methods/algorithms are developed in the literature for this problem as a single objective problem. The theoretical and algorithmic development ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Mathematical Analysis and Applications
سال: 1998
ISSN: 0022-247X
DOI: 10.1006/jmaa.1997.5786